Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines
نویسندگان
چکیده
Any finite set of lines in the real projective plane determines a cell complex; these complexes and their combinatorial properties have been a subject of study at least since 1826 [9]. More recently, Levi [6] considered a topological generalization of this notion, defined as follows: Consider a simple closed curve in RP2 which does not separate RP2; this is called a pseudoline. (It is clear that any two pseudolines must meet, and it is easy to see that if they meet at precisely one point, they must cross there.) If a finite set of pseudolines has the property that any two meet at precisely one point, but that not all pass through a common point, we speak of an urra~~eme~~ of pseudolines; the arrangement is simple if distinct pairs meet at distinct points. An arrangement of pseudolines also determines a cell complex, and Levi and others showed that a number of properties of linear complexes carry over to pseudolinear ones [6,4]. Two arrangements are c&led isomorphic if there is an isomorphism of their associated cell.complexes; it 385 0097.3165/‘80/060385-#6~02.00/0
منابع مشابه
A Brief Determination of Certain Class of Power Semicircle Distribution
In this paper, we give a new and direct proof for the recently proved conjecture raised in Soltani and Roozegar (2012). The conjecture can be proved in a few lines via the integral representation of the Gauss-hypergeometric function unlike the long proof in Roozegar and Soltani (2013).
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کامل1 4 M ay 2 01 5 The complexity of computing the minimum rank of a sign pattern matrix ̊
We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is ď 3. We complement this by giving a pol...
متن کاملThe complexity of computing the minimum rank of a sign pattern matrix
We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is ď 3. We complement this by giving a pol...
متن کاملArrangements of double pseudolines
An arrangement of double pseudolines is a finite family of at least two homotopically trivial simple closed curves embedded in the real projective plane, with the property that any two meet exactly four times, at which points they meet transversely, and induce a cell structure on the real projective plane. In this talk I will show that any arrangement of double pseudolines is isomorphic to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 29 شماره
صفحات -
تاریخ انتشار 1980